Model Reenement and Model Checking for S5 N
نویسنده
چکیده
Halpern and Vardi have proposed the notion of reenement of S5 n Kripke models in order to solve multi-agent problems in which knowledge evolves. We argue that there are some problems with their proposal and attempt to solve them by moving from Kripke models to their corresponding trees. We deene reenement of a tree with a formula, show some properties of the notion, and illustrate with the muddy children puzzle.
منابع مشابه
Simulations on Finite and In nite Graphs yMonika
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the reenement and veriication of reactive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For eeectively presented innnite graphs, we present a symbolic similarity-checking proc...
متن کاملComputing Simulations on Finite and In nite Graphs
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the reenement and veriication of reac-tive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For effectively presented innnite graphs, we present a symbolic similarity-checking pr...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملAutomated Reenement Checking for Asynchronous Processes
We consider the problem of reenement checking for asyn-chronous processes where reenement corresponds to stutter-closed language inclusion. Since an eecient algorithmic solution to the reenement check demands the construction of a witness that deenes the private speciication variables in terms of the implementation variables, we rst propose a construction to extract a synchronous witness from t...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009